Algorithm 46. Determination of an interpolating quadratic spline function
نویسندگان
چکیده
منابع مشابه
Time Registration Algorithm of Multi Sensors Based on Spline Interpolating
The time registration algorithm applicable to modern high-accuracy target tracking system is designed based on cubic spline interpolation. This algorithm can perform time registration for any quantity of sensors, the sensor measurement short of data, and the measurement of the sensor with non-uniform sampling period. The sampling rates obtained through registration can be selected according to ...
متن کاملComputing the Geodesic Interpolating Spline
We examine non-rigid image registration by knotpoint matching. We consider registering two images, each with a set of knotpoints marked, where one of the images is to be registered to the other by a nonlinear warp so that the knotpoints on the template image are exactly aligned with the corresponding knotpoints on the reference image. We explore two approaches for computing the registration by ...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملAutomatic Modelling of Fundamental Frequency Using a Quadratic Spline Function
An algorithm for the automatic coding of fundamental frequency is described using atechnique called asymmetrical modal quadratic regression. The output of the algorithm, asequence of target points , can be used as input for fundamental frequency synthesisby a quadratic spline function.
متن کاملBest Quadratic Spline Approximation
We present a method for hierarchical data approximation using quadratic simplicial elements for domain decomposition and field approximation. Higher-order simplicial elements can approximate data better than linear elements. Thus, fewer quadratic elements are required to achieve similar approximation quality. We use quadratic basis functions and compute best quadratic simplicial spline approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1976
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-15-2-245-250